Sackings leave gene database floundering

Transforming floundering into success

We show how logic programs with “delays” can be transformed to programs without delays in a way which preserves information concerning floundering (also known as deadlock). This allows a declarative (model-theoretic), bottom-up or goal independent approach to be used for analysis and debugging of properties related to floundering. We rely on some previously introduced restrictions on delay prim...

Floundering in fluoride fog.

In the last century, fl uoride, like penicillin, was heralded as a major public health advance in mankind's battle against disease and its eff ects. Today, fl uoride, like antibiotics, is under attack, a victim of its success, popularity, and ubiquity. When it comes to fl uoride in dental practice, today's clinician often has diffi culty separating fact from fi ction, solid from junk science, p...

Declarative Diagnosis of Floundering

Many logic programming languages have delay primitives which allow coroutining. This introduces a class of bug symptoms — computations can flounder when they are intended to succeed or finitely fail. For concurrent logic programs this is normally called deadlock. Similarly, constraint logic programs can fail to invoke certain constraint solvers because variables are insufficiently instantiated ...

Declarative Diagnosis of Floundering in Prolog

Many logic programming languages have delay primitives which allow coroutining. This introduces a class of bug symptoms — computations can flounder when they are intended to succeed or finitely fail. For concurrent logic programs this is normally called deadlock. Similarly, constraint logic programs can fail to invoke certain constraint solvers because variables are insufficiently instantiated ...

Flourishing or floundering in the 1990s.